Algorithmic Aspects of Some Variations of Clique Transversal and Clique Independent Sets on Graphs

This paper studies the maximum-clique independence problem and some variations of clique transversal such as {k}-clique, maximum-clique, minus clique, signed k-fold problems from algorithmic aspects for k-trees, suns, planar graphs, doubly chordal perfect total split line dually graphs. We give equations to compute numbers show that {k}-clique is polynomial-time solvable graphs whose equal their numbers. also relationship between generalization present NP-completeness results considered on k-trees with unbounded k,